Technical Report Course Notes on Theory of Computation by Thomas Zeugmann

نویسنده

  • Thomas Zeugmann
چکیده

The main purpose of this course is an introductory study of the formal relationships between machines, languages and grammars. The course covers regular languages, context-free languages and touches context-sensitive languages as well as recursive and recursively enumerable languages. Relations to and applications in UNIX are discussed, too. Moreover, we provide a framework to study the most general models of computation. These models comprise Turing machines and partial recursive functions. This allows us to reason precisely about computation and to prove mathematical theorems about its capabilities and limitations. In particular, we present the universal Turing machine which enables us to think about the capabilities of computers in a technology-independent manner. There will be a midterm problem set and a final report problem set each worth 100 points. So your grade will be based on these 200 points. Note that the course is demanding. But this is just in line with William S. Clark’s encouragement Boys, be ambitious ! Of course, nowadays, we would reformulate this encouragement as Girls and Boys, be ambitious ! Course Notes on Theory of Computation v Recommended Literature The references given below are mandatory. (1) 8¡à : — ÖhaüÈÞÈó ž Ö Information & Computing – 106, μ¤ ̈ó1>, 2005 ISBN 978-4-7819-1104-5 (2) ÝÀ+ ®ÎŸ: aüÈÞÈóh —ïý' ù ̈(, 1986 ISBN 4-563-00789-7 (3) J ÛÃ× ̄íÕÈ J ¦ëÞó : aüÈÞÈó ž Ö —Ö I, Information & Computing – 3, μ¤ ̈ó1>, 1984 ISBN 4-7819-0374-6 (4) J ÛÃ× ̄íÕÈ J ¦ëÞó : aüÈÞÈó ž Ö —Ö II, Information & Computing – 3, μ¤ ̈ó1>, 1984 ISBN 4-7819-0432-7 There are some additional references to the literature given in some lectures. So please look there, too. c ©Thomas Zeugmann, Hokkaido University, 2007 Part 1: Formal Languages

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Course Notes on Theory and Practice of Algorithms – Part I : Algorithmic Learning

This report contains the course notes of Part I of Theory and Practice of Algorithms. Within this part we deal with algorithmic learning. Some learning algorithms for fundamental learning problems are studied. Furthermore, we focus our attention on the complexity theoretical issues involved. In addition to the usual wort-case analysis, we also deal with the average-case behavior. Therefore, one...

متن کامل

Course Notes on Complexity and Cryptography

The main purpose of this course is an introductory study of computational complexity and cryptography. The rst part introduces the concept of computational complexity by looking at the basic arithmetic operations, i.e., addition, subtraction, multiplication and division. Then matrix multiplication is touched. In order to prepare everything we need later for public-key cryptography, we continue ...

متن کامل

SIGGRAPH 2002 Course Notes “Sounds Good to Me!” Computational Sound for Graphics, Virtual Reality, and Interactive Systems

This course covers concepts, models, techniques, and systems for simulation and rendering of sound in virtual environments. It will focus on real-time methods for spatializing sounds in interactive systems. Discussion will include both technical aspects of algorithms and practical aspects of applications. So, the course is appropriate both for researchers interested in learning about sound simu...

متن کامل

A Survey of Categorical Computation: Fixed Points, . . .

E. Moggi, Categories of Partial Morphism and the p -calculus, In Category Theory and Computer Programming, Lecture Notes in Computer Science 240, SpringerVerlag, 1986. [Mog88a] E. Moggi, Computational Lambda-Calculus and Monads, Technical Report ECSLFCS-88-66, University of Edinburgh, October, 1988. [Mog88b] E. Moggi, Partial Morphisms in Categories of E ective Objects, Information and Computat...

متن کامل

Some notes on sampling theory for the Part II Information Theory & Coding course

These notes are based on a Technical Report which discusses the resampling of images. A lot of the text therefore refers to images but it can easily be generalised to all forms of data which need to be sampled. In this text, the term “image” will usually mean “digital image” and the the concept of a real image is captured by the phrase “intensity surface”, i.e. a function from the 2D real plane...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007